Simple Rectilinear Polygons are Perfect under Rectangular Vision Esther Arkin∗† Michael Biro‡† Omrit Filtser§ Matthew J. Katz§† Joseph S.B. Mitchell Abstract The Art Gallery problem (see O’Rourke [3] for an

Source URL: www-cs.engr.ccny.cuny.edu

• Polygons
• Geometry
• Mathematics
• Rectilinear polygon
• Visibility polygon
• Polygon
• Art gallery problem
• Rotating calipers
• Polygon covering

Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a

Source URL: www.cims.nyu.edu

• Computational geometry
• Analysis of algorithms
• Ε-net
• Time complexity
• Art gallery problem
• Algorithm
• Randomized algorithm
• Sensor
• SL
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

THE PROBLEM: A worn, damaged, interior surface in no condition to receive floor covering on a fast-track job site. THE SOLUTION: ARDEX FEATHER FINISH™ Self-Drying, Cement-Based Finish Underlayment • FAST

Source URL: www.ardexfeatherfinish.com

CIP 28 - Concrete Slab Moisture WHAT is the Problem? Concrete slab moisture can cause problems with the adhesion of floor-covering material, such as tile, sheet flooring, or carpet and bond-related failures of non-breath

Source URL: www.dauchconcrete.com

• Building materials
• Visual arts
• Psychrometrics
• Water
• Woodworking
• Moisture vapor transmission rate
• Floor
• Moisture meter
• Epoxy Moisture Control System
• Construction
• Architecture
• Concrete

CASE STUDY CUSTOMER PORTRAIT GL events is a worldwide provider of integrated solutions and services for events covering the market’s three main segments:

Source URL: us.visual-planning.com

• Problem solving
• Project management
• Systems engineering
• Mind
• Cognitive science
• Ethology
• Management
• Neuropsychological assessment
• Planning

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering K. Daniels

Source URL: www.cccg.ca

• Heuristics
• Discrete geometry
• Mathematical optimization
• Operations research
• Minkowski addition
• Polygon
• Packing problem
• Triangle
• Geometry
• Mathematics
• Euclidean plane geometry

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 A disk-covering problem with application in optical interferometry Trung Nguyen∗ Jean-Daniel Boissonnat†

Source URL: cccg.ca

• Pi
• Geometry
• Circle
• Curves

Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡

Source URL: www.cs.technion.ac.il

• Approximation algorithms
• Complexity classes
• Polynomial-time approximation scheme
• Optimization problem
• APX
• Parameterized complexity
• Bin packing problem
• PTAS reduction
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

CCCG 2006, Kingston, Ontario, August 14–16, 2006 An Improved Approximation Factor For The Unit Disk Covering Problem Sada Narayanappa∗ Abstract

Source URL: cccg.ca

• Tessellation
• Area of a disk
• Hexagonal tiling
• Hexagon
• Geometry
• Mosaic
• Symmetry

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin

Source URL: www.cccg.ca

• Complexity classes
• Polygons
• Structural complexity theory
• Mathematical optimization
• Art gallery problem
• Approximation algorithm
• Reduction
• NP-complete
• Optimization problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics